Heuristics for matrix bandwidth reduction
نویسندگان
چکیده
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experiments show these heuristics improve solution quality when compared with the well-known GPS algorithm and recently-developed methods using tabu search and GRASP with Path Relinking. Further, the node adjustment approach obtains solutions at speeds comparable to the fast GPS algorithm. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
A systematic review of heuristics for symmetric-matrix bandwidth reduction: methods not based on metaheuristics
Heuristics for bandwidth reduction of matrices is used to reduce computational and storage costs of resolution of large sparse linear systems. Bandwidth reduction consists of carrying out permutations of lines and columns so that the coefficients remain near the main diagonal. When considering an adjacency matrix of a graph, bandwidth reduction can be considered in the sense of modifying the or...
متن کاملAn Improved Algorithm for Matrix Bandwidth and Profile Reduction in Finite Element Analysis
In finite element analysis, methods for the solution of sparse linear systems of equations usually start out with reordering the coefficient matrix to reduce its bandwidth or profile. The location of pseudo-peripheral nodes is an important factor in the bandwidth and profile reduction algorithm. This paper presents a heuristic parameter, called the “width-depth ratio” and denoted by κ. With suc...
متن کاملAverage Bandwidth Reduction in Sparse Matrices Using Hybrid Heuristics
This paper proposes a hybrid heuristic aiming the reduction of the average bandwidth of sparse matrices. The proposed heuristic combines a greedy selection of rows and columns to be interchanged with an approach based on a genetic-inspired crossover. Several ideas of limiting the search tree are also investigated. Preliminary numerical experiments illustrate the fact that the proposed heuristic...
متن کاملBandwidth and Pro le Reduction of Sparse Matrices :
The problem of sparse matrix bandwidth reduction is addressed and solved with two approaches suitable for both symmetric and non-symmetric matrices. The former is a constructive method, the latter is an application of a metaheuristic scheme. This heuristic algorithm has been implemented on parallel machines. Both approaches are compared with previous methods in the literature (suited only for s...
متن کاملOn the Probable Performance of Heuristics for Bandwidth Minimization
Most research in algorithm design relies on worst-case analysis for performance comparisons. Unfortunately, worst-case analysis does not always provide an adequate measure of an algorithm's effectiveness. This is particularly true in the case of heuristic algorithms for hard combinatorial problems. In such cases, analysis of the probable performance can yield more meaningful results and can pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 174 شماره
صفحات -
تاریخ انتشار 2006